Arithmetic Module Design and its Application to FFT
نویسندگان
چکیده
منابع مشابه
Distributed Arithmetic Based Butterfly Element for Fft Processor in 45nm Technology
ABSTRACT Fast Fourier Transform (FFT) is one of the important signal processing algorithms because of its applications in digital filtering, communication, image processing, spectral analysis and estimation etc. Butterfly computation is the basic operation in the FFT algorithm. In this work, a novel approach is thought of and used in implementing the butterfly element. Distributed Arithmetic Al...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملSimulation and Synthesis of 2048 Point FFT/IFFT for mobile Wimax 802.16e
This paper represents 2048 point Fast Fourier Transform and its inverse (FFT/IFFT) for Mobile Wi-MAX. Modified architecture also provides concept of local ROM module and variable length support from 128~2048 point for FFT/IFFT. UMC 0.18μm is used to design the same. FFT/IFFT chip consumes 266.81mW at 40MHz, 130.74mW at 20MHz and 65mW at 10 MHz for length of 2048 point. Its core size is 2.6mm x ...
متن کاملVLSI Implementation of 2048 Point FFT/IFFT for Mobile Wi-MAX
-This paper represents 2048 point Fast Fourier Transform and its inverse (FFT/IFFT) for Mobile Wi-MAX. Modified architecture also provides concept of local ROM module and variable length support from 128~2048 point for FFT/IFFT. UMC 0.18μm is used to design the same. FFT/IFFT chip consumes 266.81mW at 40MHz, 130.74mW at 20MHz and 65mW at 10 MHz for length of 2048 point. Its core size is 2.6mm x...
متن کاملSimple Computation of DIT FFT
FFT and IFFT algorithm plays an important role in design of digital signal processing. This paper describes the design of Decimation in Time-Fast Fourier Transform (DIT-FFT). The proposed design is a novel 16 bit word length processor, which is implemented with radix-2, based 8 point FFT. This approach reduces the multiplicative complexity which exists in conventional FFT implementation. For th...
متن کامل